Erasure Broadcast Channels With Intermittent Feedback
نویسندگان
چکیده
Achievable data rates in wireless systems rely heavily on the available channel state information (CSI) throughout network. However, feedback links, which provide this information, are scarce, unreliable, and subject to security threats. In work, we study impact of having intermittent links capacity region canonical two-user erasure broadcast channels. our model, at any time instant, each receiver broadcasts its CSI, other node, either becomes with unit delay or gets erased. For setting, develop a new set outer bounds capture nature links. These depend probability that CSI from both receivers erased transmitter. particular, if time, least one two is nodes, then outer-bounds match global delayed CSI. We also capacity-achieving transmission strategies under certain scenarios, establish connection between problem Blind Index Coding feedback.
منابع مشابه
Secure Capacity Region for Erasure Broadcast Channels with Feedback
We formulate and study a cryptographic problem relevant to wireless: a sender, Alice, wants to transmit private messages to two receivers, Bob and Calvin, using unreliable wireless broadcast transmissions and short public feedback from Bob and Calvin. We ask, at what rates can we broadcast the private messages if we also provide (information-theoretic) unconditional security guarantees that Bob...
متن کاملCapacity Regions of Two-Receiver Broadcast Erasure Channels with Feedback and Memory
The two-receiver broadcast packet erasure channel with feedback and memory is studied. Memory is modeled using a finitestate Markov chain representing a channel state. Two scenarios are considered: (i) when the transmitter has causal knowledge of the channel state (i.e., the state is visible), and (ii) when the channel state is unknown at the transmitter, but observations of it are available at...
متن کاملA Class of Feedback-based Coding Algorithms for Broadcast Erasure Channels with Degraded Message Sets
We consider single-hop broadcast erasure channels (BEC) with degraded message sets and instantaneous feedback regularly available from all receivers, and demonstrate that the main principles of the virtual queue-based algorithms in [1], which were proposed for multiple unicast sessions, can still be applied to this setting and lead to capacityachieving algorithms. Specifically, we propose a gen...
متن کاملCapacity of 1-to-K Broadcast Packet Erasure Channels with Channel Output Feedback (Full Version)
This paper focuses on the 1-to-K broadcast packet erasure channel (PEC), which is a generalization of the broadcast binary erasure channel from the binary symbol to that of arbitrary finite fields GF(q) with sufficiently large q. We consider the setting in which the source node has instant feedback of the channel outputs of the K receivers after each transmission. The capacity region of the 1-t...
متن کاملCoding schemes for broadcast erasure channels with feedback: the two multicast case
We consider the single hop broadcast packet erasure channel (BPEC) with two multicast sessions (each of them destined to a different group of N users) and regularly available instantaneous receiver ACK/NACK feedback. Using the insight gained from recent work on BPEC with unicast and degraded messages [1], [2], we propose a virtual queue based session-mixing algorithm, which does not rely on kno...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2021
ISSN: ['1558-0857', '0090-6778']
DOI: https://doi.org/10.1109/tcomm.2021.3102648